Mining Frequent Sub-hypergraph in an Uncertain Hypergraph for Knowledge Transfer
نویسندگان
چکیده
منابع مشابه
Frequent Hypergraph Mining
The class of frequent hypergraph mining problems is introduced which includes the frequent graph mining problem class and contains also the frequent itemset mining problem. We study the computational properties of different problems belonging to this class. In particular, besides negative results, we present practically relevant problems that can be solved in incremental-polynomial time. Some o...
متن کاملHypergraph Grammars for Knowledge Based Model Construction
Graphical belief networks, including Bayes nets and influence diagrams, can be represented with directed hypergraphs. Each directed hyperedge corresponds to a factor of the joint distribution of all variables in the model. A hyperedge replacement grammar is a collection of rules for replacing hyperedges with hypergraphs. A hyperedge replacement grammar for graphical belief networks defines a co...
متن کاملKnowledge Transformation using a Hypergraph Data Model
In the Semantic Web, knowledge integration is frequently performed between heterogeneous knowledge bases. Such knowledge integration often requires the schema expressed in one knowledge modelling language be translated into an equivalent schema in another knowledge modelling language. This paper defines how schemas expressed in OWL-DL (the Web Ontology Language using Description Logic) can be t...
متن کاملHardness for Hypergraph Coloring
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(logN) 1/10−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22Ω( √ log logN) colors. Their result is obtain...
متن کاملAn algorithmic hypergraph regularity lemma
Szemerédi’s Regularity Lemma [22, 23] is a powerful tool in graph theory. It asserts that all large graphs G admit a bounded partition of E(G), most classes of which are bipartite subgraphs with uniformly distributed edges. The original proof of this result was non-constructive. A constructive proof was given by Alon, Duke, Lefmann, Rödl and Yuster [1], which allows one to efficiently construct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Theory and Application
سال: 2015
ISSN: 2005-4270,2005-4270
DOI: 10.14257/ijdta.2015.8.4.14